Finitely inseparable first-order axiomatized mereotopological theories
نویسندگان
چکیده
منابع مشابه
A note on the interpretability logic of finitely axiomatized theories
Ill [6] Albert Visser shows that ILP completely axiomatizes all schemata about provabihty and relative interpretability that are prov-able in finitely axiomatized theories. In this paper we introduce a system called ILP ~ that completely axiomatizes the arithmetically valid principles of provability in and interpretabihty over such theories. To prove the arith-metical completeness of ILP ~ we u...
متن کاملReverse Mathematics of First-order Theories with Finitely Many Models
We examine the reverse-mathematical strength of several theorems in classical and effective model theory concerning first-order theories and their number of models. We prove that, among these, most are equivalent to one of the familiar systems RCA0, WKL0, or ACA0. We are led to a purely model-theoretic statement that implies WKL0 but refutes ACA0 over RCA0.
متن کاملUnstable First-order Theories
In this paper, we examine the divide between stable and unstable first-order theories in model theory. We begin by defining a stable theory and proving Shelah’s theorem, which reduces the question of stability to a problem of examining a single formula. Afterwards, we will provide some applications of the stability/instability divide to other model-theoretic questions, such as the question of c...
متن کاملLearning First Order Theories
In the last decade, many efforts have been devoted to the exploration of techniques for learning and refining first order theories, as the necessary step for applying machine learning methodologies to real world applications. In this paper, we present a new approach to the integration of inductive and deductive learning techniques that seems to overcome some of the limitations of existing learn...
متن کاملFinitely Generated Groups and First-order Logic
We prove that the following classes of finitely generated (f.g.) groups have Π1–complete first–order theories: all f.g. groups, the n–generated groups, and the strictly n–generated groups (n > 2). Moreover, all those theories are distinct. Similar techniques show that quasi-finitely axiomatizable (QFA) groups have a hyperarithmetical word problem, where a f.g. group is QFA if it is the only f.g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2013
ISSN: 1425-3305
DOI: 10.12775/llp.2013.016